Semi-Explicit First-Class Polymorphism for MLy
نویسنده
چکیده
We propose a modest conservative extension to ML that allows semi-explicit rst-class poly-morphism while preserving the essential properties of type inference. In our proposal, the introduction of polymorphic types is fully explicit, that is, both introduction points and exact polymorphic types are to be speciied. However, the elimination of polymorphic types is semi-implicit: only elimination points are to be speciied as polymorphic types themselves are inferred. This extension is particularly useful in Objective ML where polymorphism replaces subtyping.
منابع مشابه
Semi-Explicit First-Class Polymorphism for ML
We propose a modest conservative extension to ML that allows semiexplicit first-class polymorphism while preserving the essential properties of type inference. In our proposal, the introduction of polymorphic types is fully explicit, that is, both introduction points and exact polymorphic types are to be specified. However, the elimination of polymorphic types is semiimplicit: only elimination ...
متن کاملExtending ML with Semi-Explicit Higher-Order Polymorphism
We propose a modest conservative extension to ML that allows semi-explicit higher-order polymorphism while preserving the essential properties of ML. In our proposal, the introduction of polymorphic types remains fully explicit, that is, both the introduction and the exact polymorphic type must be speci ed. However, the elimination of polymorphic types is now semi-implicit: only the elimination...
متن کاملSemi - Expli it First - Class Polymorphism for ML †
INTRODUCTION The success of the ML language is due to its combination of several attractive features. Undoubtedly, the polymorphism of ML [Damas and Milner, 1982] —or polymorphism à la ML— with the type inference it allows, is a major advantage. The ML type system stays in close correspondence with the rules of logic, following the Curry-Howard isomorphism between types and formulas, which prov...
متن کاملDesigning a novel structure of explicit model predictive control with application in a buck converter system
This paper proposes a novel structure of model predictive control algorithm for piecewise affine systems as a particular class of hybrid systems. Due to the time consuming and computational complexity of online optimization problem in MPC algorithm, the explicit form of MPC which is called Explicit MPC (EMPC) is applied in order to control of buck converter. Since the EMPC solves the optimizati...
متن کاملAnalytic crossing probabilities for certain barriers by Brownian motion
We calculate crossing probabilities and one-sided last exit time densities for a class of moving barriers on an interval [0, T ] via Schwartz distributions. We derive crossing probabilities and first hitting time densities for another class of barriers on [0, T ] by proving a Schwartz distribution version of the method of images. Analytic expressions for crossing probabilities and related densi...
متن کامل